Titlebook: Coding and Cryptology; Third International Yeow Meng Chee,Zhenbo Guo,Chaoping Xing Conference proceedings 2011 Springer Berlin Heidelberg

显示全部楼层 · 发表于 2025-3-21 19:04:43

书目名称Coding and Cryptology影响因子(影响力)

书目名称Coding and Cryptology影响因子(影响力)学科排名

书目名称Coding and Cryptology网络公开度

书目名称Coding and Cryptology网络公开度学科排名

书目名称Coding and Cryptology被引频次

书目名称Coding and Cryptology被引频次学科排名

书目名称Coding and Cryptology年度引用

书目名称Coding and Cryptology年度引用学科排名

书目名称Coding and Cryptology读者反馈

书目名称Coding and Cryptology读者反馈学科排名

显示全部楼层 · 发表于 2025-3-21 21:14:38

Secret-Sharing Schemes: A Survey,ecret. Secret-sharing schemes are an important tool in cryptography and they are used as a building box in many secure protocols, e.g., general protocol for multiparty computation, Byzantine agreement, threshold cryptography, access control, attribute-based encryption, and generalized oblivious tran

显示全部楼层 · 发表于 2025-3-22 04:03:24

显示全部楼层 · 发表于 2025-3-22 05:48:39

List Decoding for Binary Goppa Codes,, approximately . errors in a length-. classical irreducible degree-. binary Goppa code. Compared to the best previous polynomial-time list-decoding algorithms for the same codes, the new algorithm corrects approximately . extra errors.

显示全部楼层 · 发表于 2025-3-22 10:01:04

Faster 2-Regular Information-Set Decoding,. length-. blocks, each of which has Hamming weight 0 or 2. This problem appears in attacks on the FSB (fast syndrome-based) hash function and related proposals. This problem differs from the usual information-set-decoding problems in that (1) the target codeword is required to have a very regular s

显示全部楼层 · 发表于 2025-3-22 15:35:30

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, the construction of ideal linear secret sharing schemes for access structures that are natural generalizations of the threshold ones and have interesting properties for the applications. Some of them have hierarchical properties, while other ones are suitable for situations requiring the agreement

显示全部楼层 · 发表于 2025-3-22 18:52:06

显示全部楼层 · 发表于 2025-3-23 00:33:58

显示全部楼层 · 发表于 2025-3-23 04:35:36

Algorithms for the Shortest and Closest Lattice Vector Problems,f algorithms for these problems, namely the algorithm by Micciancio and Voulgaris based on the Voronoi cell [STOC’10], the Monte-Carlo algorithms derived from the Ajtai, Kumar and Sivakumar algorithm [STOC’01] and the enumeration algorithms originally elaborated by Kannan [STOC’83] and Fincke and Po

显示全部楼层 · 发表于 2025-3-23 07:48:27

An Experiment of Number Field Sieve over GF(,) of Low Hamming Weight Characteristic,LP) over prime field GF(.), and thus it is important to evaluate the difficulty of the DLP over GF(.) for discussing the security of these protocols. The number field sieve (NFS) is asymptotically the fastest algorithm to solve the DLP over GF(.). NFS was first proposed by Gordon and then it was imp

		自动登录	找回密码
密码			To register

关于派博传思			派博传思旗下网站			友情链接
派博传思介绍	公司地理位置	论文服务流程	影响因子官网	SITEMAP	大讲堂	北京大学	Oxford Uni.	Harvard Uni.
发展历史沿革	期刊点评	投稿经验总结	SCIENCEGARD	IMPACTFACTOR	派博系数	清华大学	Yale Uni.	Stanford Uni.
\|Archiver\|手机版\|小黑屋\| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-11 22:50
Copyright © 2001-2015 派博传思京公网安备110108008328 版权所有 All rights reserved

Titlebook: Coding and Cryptology; Third International Yeow Meng Chee,Zhenbo Guo,Chaoping Xing Conference proceedings 2011 Springer Berlin Heidelberg

浏览过的版块